Limitations on post-processing assisted quantum programming
نویسندگان
چکیده
منابع مشابه
Limitations on Quantum Control
Among a wealth of applications are those to Quantum Computing, where it is clearly essential to be able to start off a quantum procedure with a given initial state, and to problems involving the population levels in atomic systems, such as the laser cooling of atomic or molecular systems. The mathematical tools necessary for the theoretical investigation of these control problems are diverse, i...
متن کاملLimitations on Quantum Dimensionality Reduction
The Johnson-Lindenstrauss Lemma is a classic result which implies that any set of n real vectors can be compressed to O(log n) dimensions while only distorting pairwise Euclidean distances by a constant factor. Here we consider potential extensions of this result to the compression of quantum states. We show that, by contrast with the classical case, there does not exist any distribution over q...
متن کاملLimitations on testing quantum theory
How much of quantum theory can be experimentally tested? We investigate this question in an extreme scenario, where the experimenter cannot make any assumptions on the quantum description of a device or state. Instead, she can only directly manipulate and interpret classical information. We prove that in this scenario, there is almost nothing that she can ascertain about the internal state of a...
متن کاملLimitations on Quantum Key Repeaters
A major application of quantum communication is the distribution of entangled particles for use in quantum key distribution. Owing to noise in the communication line, quantum key distribution is, in practice, limited to a distance of a few hundred kilometres, and can only be extended to longer distances by use of a quantum repeater, a device that performs entanglement distillation and quantum t...
متن کاملComplexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. BQP is low forPP, i.e., PPBQP = PP. There exists a relativized world whereP = BQP and the polynomial-time hierarchy is infinite. There exists a relativized world whereBQP does not have c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2017
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-017-1541-y